Learning k for kNN Classification
نویسندگان
چکیده
منابع مشابه
Research on Learning Evidence Improvement for kNN Based Classification Algorithm
Text classification (TC) is a classic research topic in computer applications. In this paper, we firstly explore the widely used distance metrics (such as Euclidean) in TC problems, and we find that these metrics may not be appropriate for highly skewed dataset like text categorization. Therefore, a novel method of learning evidence from multiple distance metric is proposed. Based on DS theory,...
متن کاملTemporal and Frequential Metric Learning for Time Series kNN Classification
This work proposes a temporal and frequential metric learning framework for a time series nearest neighbor classi cation. For that, time series are embedded into a pairwise space where a combination function is learned based on a maximum margin optimization process. A wide range of experiments are conducted to evaluate the ability of the learned metric on time series kNN classi cation.
متن کاملAssociative Classification with Knn
Associative classification usually generates a large set of rules. Therefore, it is inevitable that an instance matches several rules which classes are conflicted. In this paper, a new framework called Associative Classification with KNN (AC-KNN) is proposed, which uses an improved KNN algorithm to address rule conflicts. Traditional K-Nearest Neighbor (KNN) is low efficient due to its calculat...
متن کاملA Preliminary Performance Evaluation of K-means, KNN and EM Unsupervised Machine Learning Methods for Network Flow Classification
Received Aug 26, 2015 Revised Nov 19, 2015 Accepted Dec 7, 2015 Unsupervised leaning is a popular method for classify unlabeled dataset i.e. without prior knowledge about data class. Many of unsupervised learning are used to inspect and classify network flow. This paper presents in-deep study for three unsupervised classifiers, namely: K-means, K-nearest neighbor and Expectation maximization. T...
متن کاملKNN-CF Approach: Incorporating Certainty Factor to kNN Classification
Abstract—KNN classification finds k nearest neighbors of a query in training data and then predicts the class of the query as the most frequent one occurring in the neighbors. This is a typical method based on the majority rule. Although majority-rule based methods have widely and successfully been used in real applications, they can be unsuitable to the learning setting of skewed class distr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Intelligent Systems and Technology
سال: 2017
ISSN: 2157-6904,2157-6912
DOI: 10.1145/2990508